Combinatorial network abstraction by trees and distances

Combinatorial Network Abstraction by Trees and Distances

We draw attention to network abstraction as a fundamental problem within network analysis and visualization. A combinatorial network abstraction problem is specified by a class P of pattern graphs and a real-valued similarity measure % based on certain graph properties. For fixed P and %, the optimization task on any graph G is finding a subgraph G′ which belongs to P such that %(G,G′) is minim...

Handbook of Combinatorial Optimization Computing Distances between Evolutionary Trees

Distances and Trees in Linguistics

I think it is important to keep in mind that the term "computational linguistics" is not parallel in content with many other terms in linguistics, such as "anthropological linguistics" or "psycholinguistics", or "phonology" or "pragmatics". These terms all refer to content aspects of language; these are, respectively, the role of language in various cultures, the relations between language and ...

Probabilistic Distances Between Trees

Most existing measures of distance between phylogenetic trees are based on the geometry or topology of the trees. Instead, we consider distance measures which are based on the underlying probability distributions on genetic sequence data induced by trees. Monte Carlo schemes are necessary to calculate these distances approximately, and we describe efficient sampling procedures. Key features of ...

Genealogical trees from genetic distances

Abstract In a population with haploid reproduction any individual has a single parent in the previous generation. If all genealogical distances among pairs of individuals (generations from the closest common ancestor) are known it is possible to exactly reconstruct their genealogical tree. Unfortunately, in most cases, genealogical distances are unknown and only genetic distances are available....